Problem Difficulty in Real-Valued Dynamic Problems
نویسنده
چکیده
The article at hand identifies two kinds of problem difficulty in dynamic environments: discontinuities in the fitness landscape caused by moving optima and the discrepancy between tracking and optimization. These problem difficulties are supported by theoretical considerations and experimental findings. Various methods of resolution are discussed and a new adaptation method, namely the correction of strategy variables, is proposed.
منابع مشابه
Soft Computing-based New Interval-valued Pythagorean Triangular Fuzzy Multi-criteria Group Assessment Method without Aggregation: Application to a Transport Projects Appraisal
In this paper, an interval-valued Pythagorean triangular fuzzy number (IVPTFN) as a useful tool to handle decision-making problems with vague quantities is defined. Then, their operational laws are developed. By introducing a novel method of making a decision on the concept of possibility theory, a multi-attribute group decision-making (MAGDM) problem is considered, in which the attribute value...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملA Defined Benefit Pension Fund ALM Model through Multistage Stochastic Programming
We consider an asset-liability management (ALM) problem for a defined benefit pension fund (PF). The PF manager is assumed to follow a maximal fund valuation problem facing an extended set of risk factors: due to the longevity of the PF members, the inflation affecting salaries in real terms and future incomes, interest rates and market factors affecting jointly the PF liability and asset p...
متن کاملTowards the full information chain theory: question difficulty
A general problem of optimal information acquisition for its use in decision making problems is considered. This motivates the need for developing quantitative measures of information sources' capabilities for supplying accurate information depending on the particular content of the latter. In this article, the notion of a real valued difficulty functional for questions identified with partitio...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001